Calculating the probability of multitaxon evolutionary trees: bootstrappers Gambit.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculating the probability of multitaxon evolutionary trees :

The reconstruction of multitaxon trees from molecular sequences is confounded by the variety of algorithms and criteria used to evaluate trees, making it difficult to compare the results of different analyses. A global method of multitaxon phylogenetic reconstruction described here, Bootstrappers Gambit, can be used with any four-taxon algorithm, including distance, maximum likelihood, and pars...

متن کامل

Probability Trees

A k D tree representation of probability distribu tions is generalized to support generation of samples from conditional distributions An interpretation of the approach as a piecewise linear warping function is provided which permits a priori strati ed sample generation The representation is related to higher order spline estimators and representations via pro jection An application in glyph ba...

متن کامل

On calculating the probability of a set of orthologous sequences

Probabilistic DNA sequence models have been intensively applied to genome research. Within the evolutionary biology framework, this article investigates the feasibility for rigorously estimating the probability of a set of orthologous DNA sequences which evolve from a common progenitor. We propose Monte Carlo integration algorithms to sample the unknown ancestral and/or root sequences a posteri...

متن کامل

Calculating the Probability of a Partial Parse of a Sentence

I N T R O D U C T I O N Stochastic context-free grammars have been suggested for a role in speech-recognition algorithms, e.g. [1, 4, 9]. In order to he fully effective as an adjunct to speech recognition, the power of the probability apparatus needs to be applied to the problem of controlling the branched search for parses of ambiguous input. The method we suggest for doing this employs shift-...

متن کامل

Random trees and Probability

2 Binary search trees 2 2.1 Definition of a binary search tree . . . . . . . . . . . . . . . . . . 2 2.2 Profile of a binary search tree . . . . . . . . . . . . . . . . . . . . 3 2.2.1 Level polynomial. BST martingale . . . . . . . . . . . . . 3 2.2.2 Embedding in continuous time. Yule tree . . . . . . . . . . 6 2.2.3 Connection Yule tree binary search tree . . . . . . . . . . 7 2.2.4 Asymptoti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 1995

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.92.21.9662